Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions

Based on the extended extragradient‐like method and the linesearch technique, we propose three projection methods for finding a common solution of a finite family of equilibrium problems. The linesearch used in the proposed algorithms has allowed to reduce some conditions imposed on equilibrium bifunctions. The strongly convergent theorems are established without the Lipschitz‐type condition of bifunctions. The paper also helps in the design and analysis of practical algorithms and gives us a generalization of some previously known problems. Copyright © 2017 John Wiley & Sons, Ltd.     

Delay‐dependent criteria on the global attractivity of Nicholson's blowflies model with patch structure

In this paper, we investigate the effect of delay on the asymptotic behavior of Nicholson's blowflies model with patch structure and multiple time‐varying delays. By using the fluctuation lemma and some differential inequality technique, delay‐dependent criteria are obtained for the global attractivity of the addressed system. Meanwhile, some numerical examples are given to illustrate the feasibility of the theoretical results. Copyright © 2017 John Wiley & Sons, Ltd.     

Difference Cochains and Reidemeister Traces

The authors consider the difference of Reidemeister traces and difference cochain of given two self-maps,and find out a relation involving these two invariants.As an application,an inductive formula of the Reidemeister traces for self-maps on a kind of CW-complex,including spherical manifolds is obtained.     

A half-space projection method for solving generalized Nash equilibrium problems

The generalized Nash equilibrium problem (GNEP) is an n-person noncooperative game in which each player’s strategy set depends on the rivals’ strategy set. In this paper, we presented a half-space projection method for solving the quasi-variational inequality problem which is a formulation of the GNEP. The difference from the known projection methods is due to the next iterate point in this method is obtained by directly projecting a point onto a half-space. Thus, our next iterate point can be represented explicitly. The global convergence is proved under the minimal assumptions. Compared with the known methods, this method can reduce one projection of a vector onto the strategy set per iteration. Numerical results show that this method not only outperforms the known method but is also less dependent on the initial value than the known method.     

Modified classification of non-self-adjoint second-order difference equations

This paper is concerned with the classification of non-self-adjoint second-order difference equations. The relationship between the number of summable solutions of non-self-adjoint difference equations and that of the discrete linear Hamiltonian system is discussed. A classification for non-self-adjoint second-order difference equations is established, which is independent of the choice of the rotated half plane and the fixed point.     

Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations

Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study the scaling limits of a random permutation avoiding a pattern of length 3 and their relations to Brownian excursion. Exploring this connection to Brownian excursion allows us to strengthen the recent results of Madras and Pehlivan [25] and Miner and Pak [29] as well as to understand many of the interesting phenomena that had previously gone unexplained. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 394–419, 2017     

集值映射多目标半定规划问题的epsilon-弱有效性

对于集值映射多目标半定规划问题, 在近似锥-次类凸的框架下, 建立了含矩阵和向量的择一性定理, 给出了问题的epsilon-弱有效解的epsilon-Lagrange乘子定理及标量化定理和epsilon-弱鞍点定理．